Edge-pancyclicity of coupled graphs
نویسندگان
چکیده
The coupled graph c(G) of a plane graph G is the graph de.ned on the vertex set V (G)∪F(G) so that two vertices in c(G) are joined by an edge if and only if they are adjacent or incident in G. We prove that the coupled graph of a 2-connected plane graph is edge-pancyclic. However, there exists a 2-edge-connected plane graph G such that c(G) is not Hamiltonian. ? 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Node-pancyclicity and edge-pancyclicity of hypercube variants
Twisted cubes, crossed cubes, Möbius cubes, and locally twisted cubes are some of the widely studied hypercube variants. The 4-pancyclicity of twisted cubes, crossed cubes, Möbius cubes, locally twisted cubes and the 4-edgepancyclicity of crossed cubes are proven in [2, 1, 5, 10, 6] respectively. It should be noted that 4-edge-pancyclicity implies 4-node-pancyclicity which further implies 4-pan...
متن کاملIndependence and cycles in super line graphs
The super line graph of index r of a graph G has the r-sets of edges as its vertices, with two being adjacent if one has an edge that is adjacent to an edge in the other. In this paper, we continue our investigation of this graph by establishing two results, the first on the independence number of super line graphs of arbitrary index and the second on pancyclicity in the index-2 case.
متن کاملCERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS
In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...
متن کاملPairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs
A graph G on n vertices is Hamiltonian if it contains a spanning cycle, and pancyclic if it contains cycles of all lengths from 3 to n. In 1984, Fan presented a degree condition involving every pair of vertices at distance two for a 2-connected graph to be Hamiltonian. Motivated by Fan’s result, we say that an induced subgraph H of G is f1-heavy if for every pair of vertices u, v ∈ V (H), dH(u,...
متن کاملA New Chvátal Type Condition for Pancyclicity
Schmeichel and Hakimi ?], and Bauer and Schmeichel ?] gave an evidence in support of the well-known Bondy's "metaconjecture" that almost any non-trivial condition on graphs which implies that the graph is hamiltonian also implies that it is pancyclic. In particular, they proved that the metaconjecture is valid for Chvv atal's condition ?]. We slightly generalize their results giving a new Chvv ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 119 شماره
صفحات -
تاریخ انتشار 2002